Uniformity and Inexact Version of a Proximal Method for Metrically Regular Mappings

نویسندگان

  • Francisco J. Aragón Artacho
  • Michel H. Geoffroy
چکیده

We study stability properties of a proximal point algorithm for solving the inclusion 0 ∈ T (x) when T is a set-valued mapping that is not necessarily monotone. More precisely we show that the convergence of our algorithm is uniform, in the sense that it is stable under small perturbations whenever the set-valued mapping T is metrically regular at a given solution. We present also an inexact proximal point method for strongly metrically subregular mappings and show that it is super-linearly convergent to a solution to the inclusion 0 ∈ T (x).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An inexact alternating direction method with SQP regularization for the structured variational inequalities

In this paper, we propose an inexact alternating direction method with square quadratic proximal  (SQP) regularization for  the structured variational inequalities. The predictor is obtained via solving SQP system  approximately  under significantly  relaxed accuracy criterion  and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...

متن کامل

A Lyusternik-Graves theorem for the proximal point method

We consider a generalized version of the proximal point algorithm for solving the perturbed inclusion y ∈ T (x), where y is a perturbation element near 0 and T is a set-valued mapping acting from a Banach space X to a Banach space Y which is metrically regular around some point point (x̄, 0) in its graph. We study the behavior of the convergent iterates generated by the algorithm and we prove th...

متن کامل

Inexact Variants of the Proximal Point Algorithm without Monotonicity

This paper studies convergence properties of inexact variants of the proximal point algorithm when applied to a certain class of nonmonotone mappings. The presented algorithms allow for constant relative errors, in the line of the recently proposed hybrid proximal-extragradient algorithm. The main convergence result extends a recent work of the second author, where exact solutions for the proxi...

متن کامل

Common best proximity points for $(psi-phi)$-generalized weak proximal contraction type mappings

In this paper, we introduce a pair of generalized proximal contraction mappings and prove the existence of a unique best proximity point for such mappings in a complete metric space. We provide examples to illustrate our result. Our result extends some of the results in the literature.

متن کامل

Partial second-order subdifferentials of -prox-regular functions

Although prox-regular functions in general are nonconvex, they possess properties that one would expect to find in convex or lowerC2  functions. The class of prox-regular functions covers all convex functions, lower C2  functions and strongly amenable functions. At first, these functions have been identified in finite dimension using proximal subdifferential. Then, the definition of prox-regula...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007